package 递归.斐波那契数列.兔子问题;

public class Test {

    public static int t(int n) {
        if (n == 1 || n == 2) {
            return 1;
        }

        return t(n - 1) + t(n - 2);
    }


    public static void main(String[] args) {
        System.out.println(t(45));
    }
}
